Priority Inversion at the Network Adapter when Scheduling Messages with Earliest Deadline Techniques
نویسندگان
چکیده
In this paper we present a novel approach in the study of the predictability of real-time message transmission and its relationship with the design of network adapters for real-time distributed systems. The aim is to limit the occurrence of large priority inversions among messages, so as to achieve a better degree of predictability. We show that when the proper network adapters are used in conjunction with earliest deadline message scheduling the loss in processor utilization is minimized and predictable.
منابع مشابه
Earliest Deadline Message Scheduling with Limited PriorityInversionAntonio
This paper presents an innovative approach for scheduling network messages with real-time dynamic algorithms. The solution described in this work takes advantage of the increased network utilization allowed by dynamic scheduling methods and bounds at the same time the priority invertion phenomena caused by the lack of a suucient number of priority levels. We give a very simple formula for check...
متن کاملScheduling Messages on Controller Area Network for Real-Time Cim Applications - Robotics and Automation, IEEE Transactions on
Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (ID’s) to messages according to their priorities. In this paper we present the mixed traffic scheduler (MTS), which provides higher schedulability than fixed-priority schemes like deadline-monotonic (DM) while incurring less overhead than dynamic earliest-deadline (ED) scheduling. Through simulations, ...
متن کاملScheduling messages on controller area network for real-time CIM applications
| Scheduling messages on the Controller Area Network (CAN) corresponds to assigning identiiers (IDs) to messages according to their priorities. In this paper we present the mixed traac scheduler (MTS), which provides higher schedulability than xed-priority schemes like deadline-monotonic (DM) while incurring less overhead than dynamic earliest-deadline (ED) scheduling. Through simulations, we c...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملNon-preemptive scheduling of messages on controller area network for real-time control applications
Scheduling messages on the Controller Area Network (CAN) corresponds to assigning identiiers (IDs) to messages according to their priorities. If xed-priority scheduling such as deadline monotonic (DM) is used to calculate these priorities, then in general, it will result in low schedulability. Dynamic scheduling schemes such as earliest-deadline (ED) can give greater schedulability, but they ar...
متن کامل